Exploration of the Spatial Locality on Emerging Applications and the Consequences for Cache Performance
نویسندگان
چکیده
The performance gap between processors and memory is increasing, making the cache hit-rate paramount for performance. Studies show room for improvement, especially in data caches. The cache effectiveness is dictated by software locality, hence the software behavior directs the cache performance. This paper presents a framework for studying spatial locality. It focus on the characteristics of the spatial locality in terms of closeness in time and space, to get the amount of accessed sequential data and the potential for cache hits. By using the framework we gain knowledge for improving the cache performance. Our experiment consists of a program driven simulator and 11 important applications. We show a large performance potential in the data cache with up to 75% less miss rate, exploiting spatial locality. In order to investigate where potential bottlenecks are located we make a simple implementation of a scheme to exploit this spatial locality.
منابع مشابه
SECTORED CACHE PERFORMANCE EVALUATION: A case study on the KSR-1 data subcache
Sectoring is a cache design and management technique that is re-emerging as cache sizes get larger and computer designers strive to exploit the possible gains from using large block (line) sizes due to spatial locality. Sectoring allows for a small tag array size to suffice retaining address tags only for the large blocks, but still avoids huge miss penalties by utilizing a smaller transfer siz...
متن کاملReconciling Sharing and Spatial Locality Using Adjustable Block Size Coherent Caches
Several studies have shown that the performance of coherent caches depends on the relationship between the cache block size and the granularity of sharing and locality exhibited by the program. Large cache blocks exploit processor and spatial locality, but may cause unnecessary cache invalidations due to false sharing. Small cache blocks can reduce the number of cache invalidations, but increas...
متن کاملMemory System Support for Dynamic Cache Line Assembly
The effectiveness of cache-based memory hierarchies depends on the presence of spatial and temporal locality in applications. Memory accesses of many important applications have predictable behavior but poor locality. As a result, the performance of these applications suffers from the increasing gap between processor and memory performance. In this paper, we describe a novel mechanism provided ...
متن کاملIMPACT - 97 - 02 1 Run - time Spatial Locality Detection and Optimization
As the disparity between processor and main memory performance grows, the number of execution cycles spent waiting for memory accesses to complete also increases. As a result, latency hiding techniques are critical for improved application performance on future processors. In this paper we examine the spatial locality characteristics of several applications, and show that spatial locality varie...
متن کاملRun-Time Locality and Stride Prediction for Small Data Cache Management
In this study, we present a hardware cache management mechanism for data caches, which intelligently determines the fetch size based on the locality of reference observed at run-time. This scheme targets the cases where static prediction is not possible or has a very low accuracy (Locality varies substantially across and within applications). On a miss in the data cache, a prediction table, whi...
متن کامل